Randomized selection revisited
نویسنده
چکیده
We show that several versions of Floyd and Rivest’s algorithm Select for finding the kth smallest of n elements require at most n+min{k, n− k}+ o(n) comparisons on average and with high probability. This rectifies the analysis of Floyd and Rivest, and extends it to the case of nondistinct elements. Our computational results confirm that Select may be the best algorithm in practice.
منابع مشابه
Benign sex discrimination revisited: constitutional and moral issues in banning sex-selection abortion.
متن کامل
Faraday waves: their dispersion relation, nature of bifurcation and wavenumber selection revisited
متن کامل
QUICKSELECT Revisited
We give an overview of the running time analysis of the random divide-and-conquer algorithm FIND or QUICKSELECT. The results concern moments, distribution of FIND’s running time, the limiting distribution, a stochastic bound and the key: a stochastic fixed point equation.
متن کاملThe function ring functors of pointfree topology revisited
This paper establishes two new connections between the familiar function ring functor ${mathfrak R}$ on the category ${bf CRFrm}$ of completely regular frames and the category {bf CR}${mathbf sigma}${bf Frm} of completely regular $sigma$-frames as well as their counterparts for the analogous functor ${mathfrak Z}$ on the category {bf ODFrm} of 0-dimensional frames, given by the integer-valued f...
متن کاملCross-Linguistic Transfer Revisited: The Case of English and Persian
The present study sought to investigate the evidence for cross-linguistic transfer in a partial English immersion and non-immersion educational setting. To this end, a total of 145 first, third and fifth graders in a partial English immersion program and 95 students from the same grade levels in a non-immersion program were chosen. Six different English and Persian tests were administered: the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره cs.DS/0204033 شماره
صفحات -
تاریخ انتشار 2002